Loop and data transformations for sparse matrix code
نویسندگان
چکیده
منابع مشابه
Chain-based Scheduling: Part I { Loop Transformations and Code Generation Chain-based Scheduling: Part I { Loop Transformations and Code Generation
Chain-based scheduling 1] is an eecient partitioning and scheduling scheme for nested loops on distributed-memory multicomputers. The idea is to take advantage of the regular data dependence structure of a nested loop to overlap and pipeline the communication and computation. Most partitioning and scheduling algorithms proposed for nested loops on multicomputers 1,2,3] are graph algorithms on t...
متن کاملLoop and Data Transformations : A
In this tutorial, we address the problem of restructuring a (possibly sequential) program to improve execution eeciency on parallel machines. This restructuring involves the transformation and partitioning of loop structures and data so as to improve parallelism, static and dynamic locality, and load balance. We present previous and ongoing work on loop and data transformations and motivate a u...
متن کاملSource Code Loop Transformations for Memory Hierarchy Optimizations
Portable or embedded systems allow complex applications like multimedia today. These memory intensive applications and submicronic technologies have made the power consumption criterion crucial. We propose new source to source transformations thanks to which we can optimize the behavior of these applications by reducing the amount of needed physical memory and hence the associated power consump...
متن کاملMinimal Data Dependence Abstractions for Loop Transformations
Many abstractions of program dependences have already been proposed such as the Dependence Distance the Dependence Di rection Vector the Dependence Level or the Dependence Cone These di erent abstractions have di erent precision The min imal abstraction associated to a transformation is the abstrac tion that contains the minimal amount of information necessary to decide when such a transformati...
متن کاملChain-Based Scheduling: Part I { Loop Transformations and Code Generation
Chain-based scheduling [1] is an e cient partitioning and scheduling scheme for nested loops on distributed-memory multicomputers. The idea is to take advantage of the regular data dependence structure of a nested loop to overlap and pipeline the communication and computation. Most partitioning and scheduling algorithms proposed for nested loops on multicomputers [1,2,3] are graph algorithms on...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM SIGPLAN Notices
سال: 2015
ISSN: 0362-1340,1558-1160
DOI: 10.1145/2813885.2738003